Generalized AOR Algorithms for Linear Complementarity Problem
نویسندگان
چکیده
منابع مشابه
Generalized AOR Method for Solving Absolute Complementarity Problems
We introduce and consider a new class of complementarity problems, which is called the absolute value complementarity problem. We establish the equivalence between the absolute complementarity problems and the fixed point problem using the projection operator. This alternative equivalent formulation is used to discuss the existence of a solution of the absolute value complementarity problem. A ...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملBi-linear Complementarity Problem
In this paper, we propose a new linear complementarity problem named as bi-linear complementarity problem (BLCP) and the method for solving BLCP. In addition, the algorithm for error estimation of BLCP is also given. Numerical experiments show that the algorithm is efficient. Keywords—Bi-linear complementarity problem, Linear complementarity problem, Extended linear complementarity problem, Err...
متن کاملLinear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for *( ) P κ -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, (1 ) log n O n κ ε + , which is as ...
متن کاملThe Auxiliary Problem Algorithm for Generalized Linear Complementarity Problem Over a Polyhedral Cone∗
In this paper, we consider an auxiliary problem algorithm for solving the generalized linear complementarity problem over a polyhedral cone (GLCP). First, we equivalently reformulate the GLCP as an affine variational inequalities problem over a polyhedral cone via a linearly constrained quadratic programming under suitable assumptions, based on which we propose an auxiliary problem method to so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms & Computational Technology
سال: 2007
ISSN: 1748-3026,1748-3026
DOI: 10.1260/174830107781389030